First-Order Newton-Type Estimator for Distributed Estimation and Inference
نویسندگان
چکیده
This paper studies distributed estimation and inference for a general statistical problem with convex loss that could be non-differentiable. For the purpose of efficient computation, we restrict ourselves to stochastic first-order optimization, which enjoys low per-iteration complexity. To motivate proposed method, first investigate theoretical properties straightforward Divide-and-Conquer Stochastic Gradient Descent (DC-SGD) approach. Our theory shows there is restriction on number machines this becomes more stringent when dimension $p$ large. overcome limitation, proposes new multi-round procedure approximates Newton step only using subgradient. The key component in our method proposal computationally estimator $\Sigma^{-1} w$, where $\Sigma$ population Hessian matrix $w$ any given vector. Instead estimating (or $\Sigma^{-1}$) usually requires second-order differentiability loss, First-Order Newton-type Estimator (FONE) directly estimates vector interest w$ as whole applicable non-differentiable losses. also facilitates empirical risk minimizer. It turns out term limiting covariance has form can estimated by FONE.
منابع مشابه
First-order probabilistic inference
There have been many proposals for first-order belief networks (i.e., where we quantify over individuals) but these typically only let us reason about the individuals that we know about. There are many instances where we have to quantify over all of the individuals in a population. When we do this the population size often matters and we need to reason about all of the members of the population...
متن کاملType Checking and Weak Type Inference for Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely functions. Here, a function is called shapely when the size of the result is determined exactly by a polynomial in the sizes of the arguments. Examples of shapely functions are matrix multiplication and the Cartesian product of two lists. The type checking problem for the type system is shown to be undecidable in general. We define a n...
متن کاملAutomatic First- and Second-Order Adjoints for Truncated Newton
The analysis and modification of numerical programs in the context of generating and optimizing adjoint code automatically probably ranges among the technically and theoretically most challenging source transformation problems known today. A complete compiler for the target language (Fortran in our case) is needed to cover the technical side. This amounts to a mathematically motivated semantic ...
متن کاملApproximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete possible worlds underlying any given knowledge base. The simplicity of the approach and its lazy construction of possible worlds make it possible to consider quite expressive languages. In particular, we consider two ext...
متن کاملInference Processes for Probabilistic First Order Languages
In this thesis we will investigate inference processes for predicate languages. The main question we are concerned with in this thesis is how to choose a probability function amongst those that satisfy a certain knowledge base. This question has been extensively studied for propositional logic and we shall investigate it for rst order languages. We will rst study the generalisation of Minimum D...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Statistical Association
سال: 2021
ISSN: ['0162-1459', '1537-274X', '2326-6228', '1522-5445']
DOI: https://doi.org/10.1080/01621459.2021.1891925